Tight coupling of timing-driven placement and retiming

نویسندگان

  • Ingmar Neumann
  • Wolfgang Kunz
چکیده

Retiming is a widely investigated technique for performance optimization. In general, it performs extensive modifications on a circuit netlist, leaving it unclear, whether the achieved performance improvement will still be valid after placement has been performed. This paper presents an approach for integrating retiming into a timing-driven placement environment. The experimental results show the benefit of the proposed approach on circuit performance in comparison with design flows using retiming only as a preor postplacement optimization method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Layout driven retiming using the coupled edge timing model

Retiming is a widely investigated technique for performance optimization. It performs powerful modifications on a circuit netlist. However, often it is not clear whether the predicted performance improvement is still valid after placement has been performed. This paper presents a new retiming algorithm using a highly accurate timing model. It takes into account the effect of retiming on capacit...

متن کامل

Impact of Multi-level Clustering on Performance Driven Global Placement

Delay and wirelength minimization continue to be important objectives in the design of high-performance computing systems. For large-scale circuits, the clustering process becomes essential for reducing the problem size. However, to the best of our knowledge, there is no study about the impact of multi-level clustering on performancedriven global placement. In this paper, five clustering algori...

متن کامل

An Integrated Placement and Synthesis Approach for Timing Closure of PowerPC Microprocessors

Power Compiler: A Gate-Level Power Optimization and Synthesis System p. 74 Elastic History Buffer: A Low-Cost Method to Improve Branch Prediction Accuracy p. 82 Design Optimization for High-Speed Per-address Two-level Branch Predictors p. 88 PA-8000: A Case Study of Static and Dynamic Branch Prediction p. 97 Discrete Drive Selection for Continuous Sizing p. 110 Continuous Retiming: Algorithms a...

متن کامل

Statistical Timing Driven Partitioning for VLSI Circuits

In this paper we present statistical-timing driven partitioning for performance optimization. We show that by using the concept of node criticality we can enhance the Fiduccia-Mattheyses (FM) partitioning algorithm to achieve more than 20% improvements in terms of timing, among partitions with the same cut size. By incorporating mechanisms for timing optimization at the partitioning level, we f...

متن کامل

Broadening the Scope of Multi-Objective Optimizations in Physical Synthesis of Integrated Circuits

Broadening the Scope of Multi-Objective Optimizations in Physical Synthesis of Integrated Circuits by David Anthony Papa Chair: Igor L. Markov In modern VLSI design, physical synthesis tools are primarily responsible for satisfying chip-performance constraints by invoking a broad range of circuit optimizations, such as buffer insertion, logic restructuring, gate sizing and relocation. This proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001